package offer;
//二叉树的镜像
public class T19 {

     public class TreeNode {
         int val = 0;
         TreeNode left = null;
         TreeNode right = null;
         public TreeNode(int val) {
            this.val = val;
         }
     }
     public void Mirror(TreeNode root) {
            if (root==null) return;
            TreeNode left = root.left;
            TreeNode right = root.right;
            root.right=left;
            root.left=right;
            Mirror(left);
            Mirror(right);
     }

}
